|
A block cellular automaton or partitioning cellular automaton is a special kind of cellular automaton in which the lattice of cells is divided into non-overlapping blocks (with different partitions at different time steps) and the transition rule is applied to a whole block at a time rather than a single cell. Block cellular automata are useful for simulations of physical quantities, because it is straightforward to choose transition rules that obey physical constraints such as reversibility and conservation laws. ==Definition== A block cellular automaton consists of the following components:〔 *A regular lattice of cells *A finite set of the states that each cell may be in *A partition of the cells into a uniform tessellation in which each tile of the partition has the same size and shape *A rule for shifting the partition after each time step *A transition rule, a function that takes as input an assignment of states for the cells in a single tile and produces as output another assignment of states for the same cells. In each time step, the transition rule is applied simultaneously and synchronously to all of the tiles in the partition. Then, the partition is shifted and the same operation is repeated in the next time step, and so forth. In this way, as with any cellular automaton, the pattern of cell states changes over time to perform some nontrivial computation or simulation. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「block cellular automaton」の詳細全文を読む スポンサード リンク
|